Drawing (Complete) Binary Tanglegrams
نویسندگان
چکیده
منابع مشابه
Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability
A binary tanglegram is a drawing of a pair of rooted binary trees whose leaf sets are in one-toone correspondence; matching leaves are connected by inter-tree edges. For applications, for example, in phylogenetics, it is essential that both trees are drawn without edge crossings and that the inter-tree edges have as few crossings as possible. It is known that finding a tanglegram with the minim...
متن کاملDrawing Binary Tanglegrams: An Experimental Evaluation
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierarchical clustering, it is required that the individual trees are drawn crossing-free. A natural optimization problem, denoted tanglegram layout problem, is thus to minimize the number of crossings between inter-tree edg...
متن کاملA Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams
Given two binary phylogenetic trees covering the same n species, it is useful to compare them by drawing them with leaves arranged side-by-side. To facilitate comparison, we would like to arrange the trees to minimize the number of crossings k induced by connecting pairs of identical species. This is the NP-hard Tanglegram Layout problem. By providing a fast transformation to the Balanced Subgr...
متن کاملDrawing Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability
A binary tanglegram is a pair 〈S, T 〉 of binary trees whose leaf sets are in one-to-one correspondence; matching leaves are connected by inter-tree edges. For applications, for example in phylogenetics, it is essential that both trees are drawn with no edge crossing and that the inter-tree edges have as few crossings as possible. It is known that finding a drawing with the minimum number of cro...
متن کاملGeneralized Binary Tanglegrams: Algorithms and Applications
Several applications require the joint display of two phylogenetic trees whose leaves are matched by inter-tree edges. This issue arises, for example, when comparing gene trees and species trees or when studying the co-speciation of hosts and parasites. The tanglegram layout problem seeks to produce a layout of the two trees that minimizes the number of crossings between the inter-tree edges. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2010
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-010-9456-3